On the Branch and Cut Method for Multidimentional Mixed Integer Knapsack Problem
نویسندگان
چکیده
منابع مشابه
A Cut-and-Branch Algorithm for the Quadratic Knapsack Problem
The Quadratic Knapsack Problem (QKP) is a much-studied combinatorial optimisation problem, with many practical applications. We present a ‘cut-and-branch’ algorithm for the QKP, in which a cuttingplane phase is followed by a branch-and-bound phase. The cuttingplane phase is much more sophisticated than existing ones in the literature, incorporating several classes of cutting planes, a primal he...
متن کاملBranch-and-cut Algorithms for Integer Programming, Branch-and-cut
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...
متن کاملCooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem
Recent work in combinatorial optimization indicates the high potential of combining metaheuristics with integer linear programming (ILP) techniques. We study here a hybrid system in which a memetic algorithm (MA) and a general purpose ILP solver based on branch-and-cut (B&C) are executed in parallel and continuously exchange information in a bidirectional, asynchronous way. As target problem, w...
متن کاملOn the facets of the mixed-integer knapsack polyhedron
We study the mixed–integer knapsack polyhedron, that is, the convex hull of the mixed–integer set defined by an arbitrary linear inequality and the bounds on the variables. We describe facet–defining inequalities of this polyhedron that can be obtained through sequential lifting of inequalities containing a single integer variable. These inequalities strengthen and/or generalize known inequalit...
متن کاملExact and heuristic solution approaches for the mixed integer setup knapsack problem
We consider a class of knapsack problems that include setup costs for families of items. An individual item can be loaded into the knapsack only if a setup cost is incurred for the family to which it belongs. A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses cross decomposition. The proposed heuristic gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematical Research
سال: 2014
ISSN: 2227-4324
DOI: 10.14419/ijamr.v3i4.3378